On Approximating the Covering Radius and Finding Dense Lattice Subspaces
Coloring the Voronoi Tesselation of Lattices
A Simplex-Type Voronoi Algorithm Based on Short Vector Computations of Copositive Quadratic Forms
Lattice Packings: An Upper Bound on the Number of Perfect Lattices
When Cryptography Meets Modern Channel Coding
PPP-completeness with connections to Cryptography
Provable Sieving Algorithms for SVP and CVP in the l_p norm
Distance-Sparsity Transference for Lattice Points in Knapsack Polytopes
On Minimal Support for Lattices and Semigroups
On the Concrete Security of LWE with Small Secret
Challenges in Evaluating Costs of known Lattice Attacks
New Reductions and Algorithms for Ideal Lattices via Arakelov Random Walks
Algorithms for the k-List Problems
An LLL Algorithm for Module Lattices
New Bounds on the Covering Density
The n by n by n Cube and a Hyperplane
Short Simplex Paths in Lattice Polytopes
Successive Minima-Type Inequalities
A Reverse Minkowski Theorem